Compiling finite linear CSP into SAT
نویسندگان
چکیده
منابع مشابه
Compiling Problem Specifications into SAT
We present a compiler that translates a problem specification into a propositional satisfiability test (SAT). Problems are specified in a logic-based language, called NP-SPEC, which allows the definition of complex problems in a highly declarative way, and whose expressive power is such as to capture all problems which belong to the complexity class NP. The target SAT instance is solved using a...
متن کاملCompiling shared variable programs into CSP
We present a compiler from a simple shared variable language into CSP. This allows the application of CSP-based tools such as FDR when analysing programs written in the other language. The translation into CSP makes it easy to be flexible about the semantics of execution, most particularly the amount of atomicity that is enforced. We examine ways available to translate specifications we may wis...
متن کاملCompiling CSP
CSP, Hoare’s Communicating Sequential Processes, is a formal language for specifying, implementing and reasoning about concurrent processes and their interactions. Existing software tools that deal with CSP directly are largely concerned with assisting formal proofs. This paper presents an alternative use for CSP, namely the compilation of CSP systems to executable code. The main motivation for...
متن کاملCompiling Problem Speci cations into SAT
We present a compiler that translates a problem speciica-tion into a propositional satissability test (SAT). Problems are speciied in a logic-based language, called np-spec, which allows the deenition of complex problems in a highly declarative way, and whose expressive power is such to capture exactly all problems which belong to the complexity class NP. The target SAT instance is solved using...
متن کاملEfficient SAT-Encoding of Linear CSP Constraints
Propositional satisfiability solving (SAT) has been considerably successful in numerous industrial applications. Whereas the speed and the capacity of SAT solvers significantly improved in the last two decades, the understanding of SAT encodings is still limited and often challenging. Two wellknown variable encodings, namely the order encoding and the sparse encoding, are the most widely used a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Constraints
سال: 2008
ISSN: 1383-7133,1572-9354
DOI: 10.1007/s10601-008-9061-0